Convergence of the Weierstrass Method for Simultaneous Approximation of Polynomial Zeros
نویسندگان
چکیده
In 1891, Weierstrass presented his famous iterative method for finding all the zeros of a polynomial simultaneously. In this paper we establish three new local convergence theorems for the Weierstrass method with a posteriori and a priori error estimates. The main result of the paper generalizes, improves and complements some well known results of Dochev (1962), Kjurkchiev and Markov (1983) and Yakoubsohn (2002). The results are given for polynomials over an arbitrary normed field.
منابع مشابه
Point Estimation of Cubically Convergent Root Finding Method of Weierstrass’ Type
The aim of this paper is to state initial conditions for the safe and fast convergence of the simultaneous method of Weierstrass’ type for finding simple zeros of algebraic polynomial. This conditions are computationally verifiable and they depend only on the available data polynomial coefficients, its degree and initial approximations z 1 , . . . , z (0) n to the zeros. It is shown that under ...
متن کاملOn iteration methods without derivatives for the simultaneous determination of polynomial zeros
Carstensen, C. and M.S. PetkoviC, On iteration methods without derivatives for the simultaneous determination of polynomial zeros, Journal of Computational and Applied Mathematics 45 (1993) 251-266. Several algorithms for simultaneously approximating simple complex zeros of a polynomial are presented. These algorithms use Weierstrass’ corrections and do not require any polynomial derivatives. I...
متن کاملEuler-like Method for the Simultaneous Inclusion of Polynomial Zeros with Weierstrass’ Correction
An improved iterative method of Euler’s type for the simultaneous inclusion of polynomial zeros is considered. To accelerate the convergence of the basic method of fourth order, Carstensen-Petković’s approach [7] using Weierstrass’ correction is applied. It is proved that the R-order of convergence of the improved Euler-like method is (asymptotically) 2 + √ 7 ≈ 4.646 or 5, depending of the type...
متن کاملA New Semilocal Convergence Theorem for the Weierstrass Method from Data at One Point
In this paper we present a new semilocal convergence theorem from data at one point for the Weierstrass iterative method for the simultaneous computation of polynomial zeros. The main result generalizes and improves all previous ones in this area.
متن کاملSimultaneous Methods for Finding All Zeros of a Polynomial
The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the Weierstrass method to the zero in the trapezoidal Newton’s method, and prove the convergence of the method. We also present two modified Newton’s methods combined w...
متن کامل